Generic oracles, uniform machines, and codes
نویسندگان
چکیده
منابع مشابه
Uniform codes
Abslracf-For any prime-power Q, it is shown that there exist q-ary convolutional codes with the equidistance property that every code word is at the same distance from all code words disagreeing in the information digits to be decoded. These codes are called “uniform codes” and it is shown that they can be encoded in a very simple manner. The block codes most similar to uniform codes are the ma...
متن کاملDegrees of Dowd-Type Generic Oracles
For each positive integer r, Dowd (Information and Computation 96 (1992)) introduced r-generic oracles (we call them r-Dowd oracles; they are different from n-genericity of arithmetical forcing). An oracle D is r-Dowd if every r-query tautology with respect to D is forced by a polynomial-sized portion of D. We propose the study of degrees and complexity of 1-Dowd oracles. Dowd (1992) stated tha...
متن کاملδ-uniform BSS Machines
A δ-uniform BSS machine is a standard BSS machine which does not rely on exact equality tests. We prove that, for any real closed archimedean field R, a set is δ-uniformly semi-decidable iff it is open and semi-decidable by a BSS machine which is locally time bounded; we also prove that the local time bound condition is nontrivial. This entails a number of results about BSS machines, in particu...
متن کاملGeometrically uniform hyperbolic codes
In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes. Mathematical subject classification: 14L35, 94B60.
متن کاملUniform Resource Identifier (URI): Generic Syntax
A Uniform Resource Identifier (URI) is a compact sequence of characters that identifies an abstract or physical resource. This specification defines the generic URI syntax and a process for resolving URI references that might be in relative form, along with guidelines and security considerations for the use of URIs on the Internet. The URI syntax defines a grammar that is a superset of all vali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1992
ISSN: 0890-5401
DOI: 10.1016/0890-5401(92)90055-k